On The Shuffle-Exchange Permutation Network
نویسندگان
چکیده
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of (5/8)n + O(n), where n is the length of the permutation. (This improves on a (9/8)n routing algorithm described earlier [5].) Thus, the diameter of SEPn is at most (5/8) n 2 + O(n). We also show that the diameter is at least n / 2 O(n). We demonstrate that SEPn has a Hamilton cycle, for n 3, left open in [5], and describe embeddings of variable-degree Cayley networks, such as bubble-sort networks [1], star networks [2] and pancake networks [4] into SEPn. Our embeddings for these networks are substantial improvements of earlier results stated in [5].
منابع مشابه
Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
Rearrangeable networks can realize each and every permutation in one pass through the network. Shuffle-exchange networks provide an efficient interconnection scheme for implementing various types of parallel processes. Whether (2n − 1)-stage shuffle-exchange networks with N = 2n inputs/outputs are rearrangeable has remained an open question for approximately three decades. This question has bee...
متن کاملFault-Tolerance and Permutation Analysis of ASEN and its Variant
High performance computing systems can be designed using parallel processing. The effectiveness of these parallel systems rests primarily on the communication network linking processors and memory modules. Hence, an interconnection network that provides the desired connectivity and performance at minimum cost is required. The design of a suitable interconnection network for inter-processor comm...
متن کاملPermutation routing in optical MIN with minimum number of stages
In hybrid optical Multistage Interconnection Networks (MIN’s), optical signals are routed by electronically controlled switches using directional couplers. One important problem of these hybrid optical MIN’s is the path-dependent loss of the optical signal, which is directly proportional to the number of couplers, i.e., the number of switches through which the signal passes. In general, given t...
متن کاملOn Crosstalk-free Bpc Permutations Routing in an Optical Variable-stage Shuffle-exchange Network
The paper introduces an approach for crosstalk-free bitpermute-complement (BPC) permutations routing in hybrid optical variable-stage shuffle-exchange networks (SENs) of size where N=2, and the number of stages can vary in . The number of stages should be asserted as required by a given BPC permutation for its admissibility. The crosstalk is caused by interacting of two optical signals within t...
متن کاملA new fixed degree regular network for parallel processing
We propose a family of regular Cayley network graphs of degree three based on permutation groups for design of massively parallel systems. These graphs are shown to be based on the shuffle exchange operations, to have logarithmic diameter in the number of vertices, and to be maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and...
متن کامل